Shortest Path Problem on Intuitionistic Fuzzy Network
نویسندگان
چکیده
Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are represented by a trapezoidal intuitionistic fuzzy numbers(TrIFNs) which is the most generalized form of Trapezoidal Fuzzy Numbers(TrFNs) consisting of degree of acceptance and degree of rejection. The proposed algorithm uses Induced Intutionistic Trapezoidal Fuzzy Order Weighted Geometric (I-ITFOWG) operator for finding Intuitionistic Fuzzy Shortest Path (IFSP). A numerical example is given to explain the proposed algorithm.
منابع مشابه
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملVarious Approaches for Solving the Network Problems using TLR Intuitionistic Fuzzy Numbers
The shortest path problem is an important classical network optimization problem which has wide range of application in various fields.In this paper ,algorithms are proposed for the Intuitionistic fuzzy shortest path problem, where the arc length of the network takes imprecise numbers, instead of real numbers namely level λ triangular LR fuzzy numbers ( λ TLR). Finally an illustrative examp...
متن کاملShortest Path Problem under Intuitionistic Fuzzy Setting
Biswas, S. S. , Alam, B. , Doja, M. N. 2013. An algorithm for extracting intuitionistic fuzzy shortest path in a graph. Applied Computational Intelligence and Soft Computing, 17. Dubois, D. and Prade, H. 1980. Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York. De, P. K. and Das, D. 2012 Ranking of trapezoidal intuitionistic fuzzy numbers, Intelligent Systems Design and A...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملA New Algorithm for Solving Fuzzy Constrained Shortest Path Problem using Intuitionistic Fuzzy Numbers
Constrained shortest path problem (CSPP) is an NPComplete problem where the goal is to determine the cheapest path bounded by a given delay constraint. This problem finds application in several fields like television and transportation networks, ATM circuit routing, multimedia applications etc. In these kinds of applications it is important to provide quality of service (QoS). Therefore, it is ...
متن کامل